package search

// BinarySearch searches for target in a sorted slice and returns the position
// where target is found, or the position where target would appear in the
// sort order; it also returns a bool saying whether the target is really found
// in the slice. The slice must be sorted in increasing order. 切片必须按递增顺序进行排序
func Sqrt(x int) (int, bool) {
	if x <= 1 {
		return x, false
	}
	l := 1
	h := x

	for l <= h {
		mid := l + (h-l)>>1
		sqrt := x / mid
	}
}
